//Wed Jul  6 15:05:39 CDT 2011
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

class FiveHundredEleven {
public:
	string theWinner(vector <int>);
	int N;
	vector<int> c;
	int visited[512][51];
	
	int winning(int mem, int played){
		if(mem==511) return 1;
		if(played==N) return 0;
		int &ret = visited[mem][played];
		if(ret != -1) return ret;
		int cnt = 0;
		for(int i=0; i<N; i++) 
			if((mem | c[i]) == mem)
				cnt++;
		if(cnt > played && !winning(mem, played+1)) return ret = 1;
		for(int i=0; i<N; i++){
			if((mem | c[i]) != mem && !winning(mem|c[i], played+1))
				return ret = 1;
		}
		return ret = 0;
	}
};

string FiveHundredEleven::theWinner(vector <int> cards) {
	N = cards.size();
	c = cards;
	memset(visited, -1, sizeof(visited));
	if(winning(0, 0)) return "Fox Ciel";
	return "Toastman";
}


//Powered by [KawigiEdit] 2.0!
